0.00/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : run_E %s %d THM 0.11/0.32 % Computer : n025.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 960 0.11/0.32 % WCLimit : 120 0.11/0.32 % DateTime : Tue Aug 9 03:55:26 EDT 2022 0.11/0.33 % CPUTime : 0.18/0.46 Running higher-order on 8 cores theorem proving 0.18/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.18/0.46 # Version: 3.0pre003-ho 0.18/0.47 # Preprocessing class: HSMSSMSSMLMNHSN. 0.18/0.47 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.18/0.47 # Starting ho_unfolding_3 with 600s (5) cores 0.18/0.47 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.18/0.47 # Starting almost_fo_3_lam with 120s (1) cores 0.18/0.47 # Starting post_as_ho1 with 120s (1) cores 0.18/0.47 # ehoh_best2_full_lfho with pid 26975 completed with status 0 0.18/0.47 # Result found by ehoh_best2_full_lfho 0.18/0.47 # Preprocessing class: HSMSSMSSMLMNHSN. 0.18/0.47 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.18/0.47 # Starting ho_unfolding_3 with 600s (5) cores 0.18/0.47 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.18/0.47 # No SInE strategy applied 0.18/0.47 # Search class: HHHNM-FFSF21-SHSSMFNN 0.18/0.47 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.18/0.47 # Starting new_ho_10 with 65s (1) cores 0.18/0.47 # new_ho_10 with pid 26978 completed with status 0 0.18/0.47 # Result found by new_ho_10 0.18/0.47 # Preprocessing class: HSMSSMSSMLMNHSN. 0.18/0.47 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.18/0.47 # Starting ho_unfolding_3 with 600s (5) cores 0.18/0.47 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.18/0.47 # No SInE strategy applied 0.18/0.47 # Search class: HHHNM-FFSF21-SHSSMFNN 0.18/0.47 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.18/0.47 # Starting new_ho_10 with 65s (1) cores 0.18/0.47 # Preprocessing time : 0.002 s 0.18/0.47 # Presaturation interreduction done 0.18/0.47 0.18/0.47 # Proof found! 0.18/0.47 # SZS status Theorem 0.18/0.47 # SZS output start CNFRefutation 0.18/0.47 thf(decl_22, type, qmltpeq: mu > mu > $i > $o). 0.18/0.47 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.18/0.47 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_26, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_27, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.18/0.47 thf(decl_28, type, mtrue: $i > $o). 0.18/0.47 thf(decl_29, type, mfalse: $i > $o). 0.18/0.47 thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_31, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_32, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_33, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_34, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_35, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.18/0.47 thf(decl_36, type, exists_in_world: mu > $i > $o). 0.18/0.47 thf(decl_37, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.18/0.47 thf(decl_38, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.18/0.47 thf(decl_39, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.18/0.47 thf(decl_40, type, mreflexive: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_41, type, msymmetric: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_42, type, mserial: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_43, type, mtransitive: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_44, type, meuclidean: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_45, type, mpartially_functional: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_46, type, mfunctional: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_47, type, mweakly_dense: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_48, type, mweakly_connected: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_49, type, mweakly_directed: ($i > $i > $o) > $o). 0.18/0.47 thf(decl_50, type, mvalid: ($i > $o) > $o). 0.18/0.47 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.18/0.47 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.18/0.47 thf(decl_53, type, minvalid: ($i > $o) > $o). 0.18/0.47 thf(decl_54, type, rel_s4: $i > $i > $o). 0.18/0.47 thf(decl_55, type, mbox_s4: ($i > $o) > $i > $o). 0.18/0.47 thf(decl_56, type, mdia_s4: ($i > $o) > $i > $o). 0.18/0.47 thf(decl_57, type, teach: mu > mu > $i > $o). 0.18/0.47 thf(decl_58, type, sue: mu). 0.18/0.47 thf(decl_59, type, psych: mu). 0.18/0.47 thf(decl_60, type, mary: mu). 0.18/0.47 thf(decl_61, type, math: mu). 0.18/0.47 thf(decl_62, type, john: mu). 0.18/0.47 thf(decl_63, type, cs: mu). 0.18/0.47 thf(decl_64, type, esk1_1: $i > mu). 0.18/0.47 thf(decl_65, type, esk2_0: $i). 0.18/0.47 thf(decl_66, type, esk3_0: $i). 0.18/0.47 thf(decl_67, type, esk4_2: $i > $i > mu). 0.18/0.47 thf(mexists_ind, axiom, ((mexists_ind)=(^[X12:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X13:mu]:(mnot @ (X12 @ X13))))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mexists_ind)). 0.18/0.47 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mnot)). 0.18/0.47 thf(mforall_ind, axiom, ((mforall_ind)=(^[X10:mu > $i > $o, X3:$i]:(![X11:mu]:(((exists_in_world @ X11 @ X3)=>(X10 @ X11 @ X3)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mforall_ind)). 0.18/0.47 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o]:(mnot @ (mor @ (mnot @ X4) @ (mnot @ X5))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mand)). 0.18/0.47 thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mor)). 0.18/0.47 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL015^0.ax', mvalid)). 0.18/0.47 thf(mbox_s4, axiom, ((mbox_s4)=(^[X4:$i > $o, X3:$i]:(![X7:$i]:((~((rel_s4 @ X3 @ X7))|(X4 @ X7)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax', mbox_s4)). 0.18/0.47 thf(query, conjecture, (mvalid @ (mbox_s4 @ (mexists_ind @ (^[X20:mu]:(teach @ X20 @ cs))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', query)). 0.18/0.47 thf(db, axiom, (mvalid @ (mbox_s4 @ (mand @ (teach @ john @ math) @ (mand @ (mexists_ind @ (^[X21:mu]:(teach @ X21 @ cs))) @ (mand @ (teach @ mary @ psych) @ (teach @ sue @ psych)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', db)). 0.18/0.47 thf(c_0_9, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X34:mu]:(((exists_in_world @ X34 @ Z1)=>(~((Z0 @ X34 @ Z1)))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])). 0.18/0.47 thf(c_0_10, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.18/0.47 thf(c_0_11, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X11:mu]:(((exists_in_world @ X11 @ Z1)=>(Z0 @ X11 @ Z1)))))), inference(fof_simplification,[status(thm)],[mforall_ind])). 0.18/0.47 thf(c_0_12, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.18/0.47 thf(c_0_13, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.18/0.47 thf(c_0_14, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X34:mu]:(((exists_in_world @ X34 @ Z1)=>(~((Z0 @ X34 @ Z1)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9, c_0_10]), c_0_11])). 0.18/0.47 thf(c_0_15, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.18/0.47 thf(c_0_16, plain, ((mbox_s4)=(^[Z0:$i > $o, Z1:$i]:(![X7:$i]:((~((rel_s4 @ Z1 @ X7))|(Z0 @ X7)))))), inference(fof_simplification,[status(thm)],[mbox_s4])). 0.18/0.47 thf(c_0_17, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_10]), c_0_13])). 0.18/0.47 thf(c_0_18, negated_conjecture, ~(![X43:$i, X42:$i]:((~(rel_s4 @ X43 @ X42)|~(![X41:mu]:(((exists_in_world @ X41 @ X42)=>~(teach @ X41 @ cs @ X42))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[query])]), c_0_14]), c_0_15]), c_0_16])])). 0.18/0.47 thf(c_0_19, plain, ![X46:$i, X45:$i]:((~(rel_s4 @ X46 @ X45)|~((~(teach @ john @ math @ X45)|~(~((~(~(![X44:mu]:(((exists_in_world @ X44 @ X45)=>~(teach @ X44 @ cs @ X45)))))|~(~((~(teach @ mary @ psych @ X45)|~(teach @ sue @ psych @ X45))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[db]), c_0_17]), c_0_14]), c_0_15]), c_0_16])])). 0.18/0.47 thf(c_0_20, negated_conjecture, ![X61:mu]:(((rel_s4 @ esk2_0 @ esk3_0)&(~(exists_in_world @ X61 @ esk3_0)|~(teach @ X61 @ cs @ esk3_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])). 0.18/0.47 thf(c_0_21, plain, ![X62:$i, X63:$i]:((((teach @ john @ math @ X63)|~(rel_s4 @ X62 @ X63))&((((exists_in_world @ (esk4_2 @ X62 @ X63) @ X63)|~(rel_s4 @ X62 @ X63))&((teach @ (esk4_2 @ X62 @ X63) @ cs @ X63)|~(rel_s4 @ X62 @ X63)))&(((teach @ mary @ psych @ X63)|~(rel_s4 @ X62 @ X63))&((teach @ sue @ psych @ X63)|~(rel_s4 @ X62 @ X63)))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])). 0.18/0.47 thf(c_0_22, negated_conjecture, ![X11:mu]:((~((exists_in_world @ X11 @ esk3_0))|~((teach @ X11 @ cs @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_20])). 0.18/0.47 thf(c_0_23, plain, ![X3:$i, X7:$i]:(((teach @ (esk4_2 @ X3 @ X7) @ cs @ X7)|~((rel_s4 @ X3 @ X7)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.18/0.47 thf(c_0_24, plain, ![X3:$i, X7:$i]:(((exists_in_world @ (esk4_2 @ X3 @ X7) @ X7)|~((rel_s4 @ X3 @ X7)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.18/0.47 thf(c_0_25, negated_conjecture, (rel_s4 @ esk2_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_20])). 0.18/0.47 thf(c_0_26, negated_conjecture, ![X3:$i]:(~((rel_s4 @ X3 @ esk3_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])). 0.18/0.47 thf(c_0_27, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_25, c_0_26]), ['proof']). 0.18/0.47 # SZS output end CNFRefutation 0.18/0.47 # Parsed axioms : 87 0.18/0.47 # Removed by relevancy pruning/SinE : 0 0.18/0.47 # Initial clauses : 60 0.18/0.47 # Removed in clause preprocessing : 43 0.18/0.47 # Initial clauses in saturation : 17 0.18/0.47 # Processed clauses : 40 0.18/0.47 # ...of these trivial : 0 0.18/0.47 # ...subsumed : 0 0.18/0.47 # ...remaining for further processing : 40 0.18/0.47 # Other redundant clauses eliminated : 0 0.18/0.47 # Clauses deleted for lack of memory : 0 0.18/0.47 # Backward-subsumed : 0 0.18/0.47 # Backward-rewritten : 0 0.18/0.47 # Generated clauses : 22 0.18/0.47 # ...of the previous two non-redundant : 11 0.18/0.47 # ...aggressively subsumed : 0 0.18/0.47 # Contextual simplify-reflections : 1 0.18/0.47 # Paramodulations : 21 0.18/0.47 # Factorizations : 0 0.18/0.47 # NegExts : 0 0.18/0.47 # Equation resolutions : 0 0.18/0.47 # Propositional unsat checks : 0 0.18/0.47 # Propositional check models : 0 0.18/0.47 # Propositional check unsatisfiable : 0 0.18/0.47 # Propositional clauses : 0 0.18/0.47 # Propositional clauses after purity: 0 0.18/0.47 # Propositional unsat core size : 0 0.18/0.47 # Propositional preprocessing time : 0.000 0.18/0.47 # Propositional encoding time : 0.000 0.18/0.47 # Propositional solver time : 0.000 0.18/0.47 # Success case prop preproc time : 0.000 0.18/0.47 # Success case prop encoding time : 0.000 0.18/0.47 # Success case prop solver time : 0.000 0.18/0.47 # Current number of processed clauses : 22 0.18/0.47 # Positive orientable unit clauses : 11 0.18/0.47 # Positive unorientable unit clauses: 0 0.18/0.47 # Negative unit clauses : 1 0.18/0.47 # Non-unit-clauses : 10 0.18/0.47 # Current number of unprocessed clauses: 5 0.18/0.47 # ...number of literals in the above : 6 0.18/0.47 # Current number of archived formulas : 0 0.18/0.47 # Current number of archived clauses : 18 0.18/0.47 # Clause-clause subsumption calls (NU) : 6 0.18/0.47 # Rec. Clause-clause subsumption calls : 6 0.18/0.47 # Non-unit clause-clause subsumptions : 1 0.18/0.47 # Unit Clause-clause subsumption calls : 5 0.18/0.47 # Rewrite failures with RHS unbound : 0 0.18/0.47 # BW rewrite match attempts : 4 0.18/0.47 # BW rewrite match successes : 0 0.18/0.47 # Condensation attempts : 40 0.18/0.47 # Condensation successes : 0 0.18/0.47 # Termbank termtop insertions : 3371 0.18/0.47 0.18/0.47 # ------------------------------------------------- 0.18/0.47 # User time : 0.005 s 0.18/0.47 # System time : 0.004 s 0.18/0.47 # Total time : 0.008 s 0.18/0.47 # Maximum resident set size: 1912 pages 0.18/0.47 0.18/0.47 # ------------------------------------------------- 0.18/0.47 # User time : 0.006 s 0.18/0.47 # System time : 0.007 s 0.18/0.47 # Total time : 0.013 s 0.18/0.47 # Maximum resident set size: 1812 pages 0.18/0.47 EOF